As the data center backlash grows, support is growing for server factories and the hundreds of jobs they're expected to bring. Last month, Pamela Griffin and two other residents of Taylor, Texas, took to the lectern at a city council meeting to object to a data center project. But later, they sat back as council members discussed a proposed tech factory. Griffin didn't speak up against that development. A similar contrast is repeating in communities across the US.

This paper presents the implementation of a self-replicating finite-state machine (FSM) and a self-replicating Turing Machine (TM) using bio-inspired mechanisms. Building on previous work that introduced self-replicating structures capable of sorting, copying, and reading information, this study demonstrates the computational power of these mechanisms by explicitly constructing a functioning FSM and TM. This study demonstrates the universality of the system by emulating the UTM(5,5) of Neary and Woods.

This study presents a theoretical model for a self-replicating mechanical system inspired by biological processes within living cells and supported by computer simulations. The model decomposes self-replication into core components, each of which is executed by a single machine constructed from a set of basic block types. Key functionalities such as sorting, copying, and building, are demonstrated. The model provides valuable insights into the constraints of self-replicating systems. The discussion also addresses the spatial and timing behavior of the system, as well as its efficiency and complexity. This work provides a foundational framework for future studies on self-replicating mechanisms and their information-processing applications.

Undirected graphical models, also known as Markov networks, enjoy popularity in a variety of applications. The popular instances of these models such as Gaussian Markov Random Fields (GMRFs), Ising models, and multinomial discrete models, however do not capture the characteristics of data in many settings. We introduce a new class of graphical models based on generalized linear models (GLMs) by assuming that node-wise conditional distributions arise from exponential families. Our models allow one to estimate multivariate Markov networks given any univariate exponential distribution, such as Poisson, negative binomial, and exponential, by fitting penalized GLMs to select the neighborhood for each node. A major contribution of this paper is the rigorous statistical analysis showing that with high probability, the neighborhood of our graphical models can be recovered exactly. We also provide examples of non-Gaussian high-throughput genomic networks learned via our GLM graphical models.

In 2023, people who want to reside in Georgetown, Texas, may have the opportunity to live in a large, 3D-printed neighborhood. Homebuyers interested in relocating to Georgetown, Texas, may have the opportunity to live in a large, 3D-printed neighborhood. ICON, a construction tech company, along with Lennar, a home construction company and Bjarke Ingels Group (BIG), an architecture company, are teaming up to develop Wolf Ranch -- a 100-home, 3D-printed community. "Wolf Ranch marks the largest community of its kind in development in the world and in partnership with one of the largest home builders in the country, Lennar," Dmitri Julius, chief of special projects at ICON, told Fox News Digital. The partnership between Austin-based ICON and Lennar "offers a promising path toward an alternate method of delivering technology-driven homes that meet rising demand in desirable communities," Julius added.

Minecraft is a great testbed for human creativity that has inspired the design of various structures and even functioning machines, including flying machines. EvoCraft is an API for programmatically generating structures in Minecraft, but the initial work in this domain was not capable of evolving flying machines. This paper applies fitness-based evolution and quality diversity search in order to evolve flying machines. Although fitness alone can occasionally produce flying machines, thanks in part to a more sophisticated fitness function than was used previously, the quality diversity algorithm MAP-Elites is capable of discovering flying machines much more reliably, at least when an appropriate behavior characterization is used to guide the search for diverse solutions.

ALEXANDRIA, Va.--Innovation came to life for the Conexxus Innovation Research Committee (IRC) during a recent field trip that members made to multiple sites in Austin, Texas. One of the hallmarks of the IRC is to experience what's new for the industry firsthand. A visit to a new TXB Stores location in Georgetown, Texas, was on the list not only to taste its breakfast taco but also to see how an artificial intelligence pilot utilizing existing security camera system has progressed. Utilizing SparkCognition's Visual AI Advisor solution, the insights from the location visit were intriguing and revealing. To review the data, we visited with SparkCognition representatives at their offices and HyperWerx lab on a 50-acre site.

We introduce a scalable approach to Gaussian process inference that combines spatio-temporal filtering with natural gradient variational inference, resulting in a non-conjugate GP method for multivariate data that scales linearly with respect to time. Our natural gradient approach enables application of parallel filtering and smoothing, further reducing the temporal span complexity to be logarithmic in the number of time steps. We derive a sparse approximation that constructs a state-space model over a reduced set of spatial inducing points, and show that for separable Markov kernels the full and sparse cases exactly recover the standard variational GP, whilst exhibiting favourable computational properties. To further improve the spatial scaling we propose a mean-field assumption of independence between spatial locations which, when coupled with sparsity and parallelisation, leads to an efficient and accurate method for large spatio-temporal problems.

Generative Adversarial Networks (GANs) are a powerful indirect genotype-to-phenotype mapping for evolutionary search, but they have limitations. In particular, GAN output does not scale to arbitrary dimensions, and there is no obvious way to combine GAN outputs into a cohesive whole, which would be useful in many areas, such as video game level generation. Game levels often consist of several segments, sometimes repeated directly or with variation, organized into an engaging pattern. Such patterns can be produced with Compositional Pattern Producing Networks (CPPNs). Specifically, a CPPN can define latent vector GAN inputs as a function of geometry, which provides a way to organize level segments output by a GAN into a complete level. However, a collection of latent vectors can also be evolved directly, to produce more chaotic levels. Here, we propose a new hybrid approach that evolves CPPNs first, but allows the latent vectors to evolve later, and combines the benefits of both approaches. These approaches are evaluated in Super Mario Bros. and The Legend of Zelda. We previously demonstrated via divergent search (MAP-Elites) that CPPNs better cover the space of possible levels than directly evolved levels. Here, we show that the hybrid approach can cover areas that neither of the other methods can and achieves comparable or superior QD scores.